A note on forcing 3-repetitions in degree sequences
نویسندگان
چکیده
منابع مشابه
Forcing $k$-repetitions in Degree Sequences
One of the most basic results in graph theory states that every graph with at least two vertices has two vertices with the same degree. Since there are graphs without 3 vertices of the same degree, it is natural to ask if for any fixed k, every graph G is “close” to a graph G′ with k vertices of the same degree. Our main result in this paper is that this is indeed the case. Specifically, we sho...
متن کاملOn Degree Sequences Forcing The Square of a Hamilton Cycle
A famous conjecture of Pósa from 1962 asserts that every graph on n vertices and with minimum degree at least 2n/3 contains the square of a Hamilton cycle. The conjecture was proven for large graphs in 1996 by Komlós, Sárközy and Szemerédi [23]. In this paper we prove a degree sequence version of Pósa’s conjecture: Given any η > 0, every graph G of sufficiently large order n contains the square...
متن کاملA Further Note on Runs in Independent Sequences
Given a sequence of letters generated independently from a finite alphabet, we consider the case when more than one, but not all, letters are generated with the highest probability. The length of the longest run of any of these letters is shown to be one greater than the length of the longest run in a particular state of an associated Markov chain. Using results of Foulser and Karlin (19...
متن کاملA note on the degree sequences of graphs with restrictions
Degree sequences of some types of graphs will be studied and characterized in this paper.
متن کاملNote on forcing pairs
The notion of forcing pairs is located in the study of quasi-random graphs. Roughly speaking, a pair of graphs (F, F ′) is called forcing if the following holds: Suppose for a sequence of graphs (Gn) there is a p > 0 such that the number of copies of F and the number of copies of F ′ in every graph Gn of the sequence (Gn) is approximately the same as the expected value in the random graph G(n, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2020
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2376